An Artificial Bee Colony Algorithm Based on Problem Data Properties for Scheduling Job Shops

نویسنده

  • Rui Zhang
چکیده

To solve the job shop scheduling problem with the objective of minimizing total weighted tardiness, an artificial bee colony algorithm based on problem data analysis is proposed. First, characteristic values are defined to describe the criticality of each job in the process of scheduling and optimization. Then, a fuzzy inference system is employed to evaluate the characteristic values according to practical scheduling knowledge. Finally, a local search mechanism is designed based on the idea that critical jobs should be processed with higher priority. Numerical computations are conducted with an artificial bee colony algorithm which integrates the local search module. The computational results for problems of different sizes show that the proposed algorithm is both effective and efficient.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modelling and Scheduling Lot Streaming Flexible Flow Lines

Although lot streaming scheduling is an active research field, lot streaming flexible flow lines problems have received far less attention than classical flow shops. This paper deals with scheduling jobs in lot streaming flexible flow line problems. The paper mathematically formulates the problem by a mixed integer linear programming model. This model solves small instances to optimality. Moreo...

متن کامل

An efficient job shop scheduling algorithm based on artificial bee colony

The job shop scheduling problem (JSSP) is an NP-hard problem of wide engineering and theoretical background. In this paper, a discrete artificial bee colony based memetic algorithm, named DABC, is proposed for solving JSSP. Firstly, to make artificial bee colony (ABC) suitable for solving JSSP, we present a food source as a discrete job permutation and use the discrete operation to generate a n...

متن کامل

An Efficient Modified Artificial Bee Colony Algorithm for Job Scheduling Problem

Swarm intelligence systems are typically made up of a population of simple agents or boids interacting locally with one another and with their environment. Particle swarm, Ant colony, Bee colony are examples of swarm intelligence. In the field of computer science and operations research, Artificial Bee Colony Algorithm (ABC) is an optimization algorithm based on the intelligent foraging behavio...

متن کامل

A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion

This study addresses the scheduling problem in remanufacturing engineering. The purpose of this paper is to model effectively to solve remanufacturing scheduling problem. The problem is modeled as flexible job-shop scheduling problem (FJSP) and is divided into two stages: scheduling and re-scheduling when new job arrives. The uncertainty in timing of returns in remanufacturing is modeled as new...

متن کامل

An improved artificial bee colony algorithm for the blocking flowshop scheduling problem

This paper presents an improved artificial bee colony (IABC) algorithm for solving the blocking flowshop problem with the objective of minimizing makespan. The proposed IABC algorithm utilizes discrete job permutations to represent solutions and applies insert and swap operators to generate new solutions for the employed and onlooker bees. The differential evolution algorithm is employed to obt...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015